Applying Search Algorithms to the Temperature Inversion problem
نویسنده
چکیده
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary algorithms do not perform well on these problems. This paper investigates why the temperature inversion problem is so difficult for heuristic search. We show that algorithms imposing smoothness constraints find more competitive solutions. Additionally, a new algorithm is presented that addresses the difficulties of this problem and finds approximate solutions fast.
منابع مشابه
Non-linear stochastic inversion of 2D gravity data using evolution strategy (ES)
In the current work, a 2D non-linear inverse problem of gravity data is solved using the evolution strategies (ES) to find the thickness of a sedimentary layer in a deep-water situation where a thick sedimentary layer usually exists. Such problems are widely encountered in the early stages of petroleum explorations where potential field data are used to find an initial estimate of the basin geo...
متن کاملCuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کاملComparing Search Algorithms for the Temperature Inversion Problem
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary algorithms do not perform well on these problems. This paper investigates why the temperature inversion problem is so difficult for heuristic search. We show that algorithms imposing smoothness constraints find more c...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005